Grouptheoretical investigations on computers
نویسندگان
چکیده
منابع مشابه
Making Computers Laugh: Investigations in Automatic Humor Recognition
Humor is one of the most interesting and puzzling aspects of human behavior. Despite the attention it has received in fields such as philosophy, linguistics, and psychology, there have been only few attempts to create computational models for humor recognition or generation. In this paper, we bring empirical evidence that computational approaches can be successfully applied to the task of humor...
متن کاملOn Vague Computers
Vagueness is something everyone is familiar with. In fact, most people think that vagueness is closely related to language and exists only there. However, vagueness is a property of the physical world. Quantum computers harness superposition and entanglement to perform their computational tasks. Both superposition and entanglement are vague processes. Thus quantum computers, which process exact...
متن کاملPhysician's Primer on Computers
ologists, and at least three subspecialty surgeons, so attesting to the interdisciplinary nature of sleep apnea syndromes. Sleep apnea syndromes are of two types, the so-called central apneas and those arising from partial or complete obstruction in the upper airway. This volume focusses heavily on the latter variety and clearly indicates the diagnostic requirements and the multiple functional ...
متن کاملQuantum Gravity on Computers
Some times Thomas Hardy has been compared to Dostoevski, but Dostoevski is an incomparably ner artist. If Dostoevski's works could be compared to some of say, Rubens' paintings, then Hardy's are neatly nished diagrams drawn on graph paper with ruler and compass! Compare for instance the tragedy to Tess with that of Sonia, or the culmination of the forces in Raskolnikoo's confession with the mel...
متن کاملInvestigations on autark assignments
The structure of the monoid of autarkies for clause-sets is investigated (autarkies are generalizations of satisfying (truth) assignments). The notion of a \plain clause-set" is introduced, where every clause is usable by some resolution refutation, and it is shown that a clause-set is plain ii it has no non-trivial autarky. Every clause-set has a unique decomposition into a plain sub-clause-se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mémoires de la Société mathématique de France
سال: 1977
ISSN: 0249-633X,2275-3230
DOI: 10.24033/msmf.215